نتایج جستجو برای: Kirchhoff strings

تعداد نتایج: 21075  

Journal: :international journal of nonlinear analysis and applications 2015
p. papadopoulos n.l. matiadou a. pappas

we discuss the asymptotic behaviour of solutions for the nonlocal quasilinear hyperbolic problem of kirchhoff type [ u_{tt}-phi (x)||nabla u(t)||^{2}delta u+delta u_{t}=|u|^{a}u,, x in mathbb{r}^{n} ,,tgeq 0;,]with initial conditions $u(x,0) = u_0 (x)$ and $u_t(x,0) = u_1 (x)$, in the case where $n geq 3, ; delta geq 0$ and $(phi (x))^{-1} =g (x)$  is a positive function lying in $l^{n/2}(mathb...

2007
Pietro Baldi

We consider Kirchhoff equations for vibrating strings and elastic membranes under the action of an external forcing of period 2π/ω and small amplitude ε. We prove existence, regularity and local uniqueness of 2π/ω-periodic solutions of order ε by means of a Nash-Moser iteration scheme; the results hold for parameters (ω, ε) in a Cantor-like set which has asymptotically full measure for ε→ 0.

Journal: :Journal of Mathematical Analysis and Applications 2000

Journal: :Demonstratio Mathematica 2023

Abstract The Kirchhoff model is derived from the vibration problem of stretchable strings. This article focuses on long-time dynamics a class higher-order coupled systems with nonlinear strong damping. existence and uniqueness solutions these equations in different spaces are proved by prior estimation Faedo-Galerkin method. Subsequently, family global attractors problems using compactness theo...

For any simple connected undirected graph, it is well known that the Kirchhoff and multiplicative degree-Kirchhoff indices can be computed using the Laplacian matrix. We show that the same is true for the additive degree-Kirchhoff index and give a compact Matlab program that computes all three Kirchhoffian indices with the Laplacian matrix as the only input.

ژورنال: پژوهش های ریاضی 2017
abdolahinohoji, h., kazemi, r, norouzi, s,

Tries are the most popular data structure on strings. We can construct d-ary tries by using strings over an alphabet leading to d-ary tries. Throughout the paper we assume that strings stored in trie are generated by an appropriate memory less source. In this paper, with a special combinatorial approach we extend their analysis for average profiles to d-ary tries. We use this combinatorial appr...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید